A database of linear codes over F13 with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm
نویسندگان
چکیده
Error control codes have been widely used in data communications and storage systems. One central problem in coding theory is to optimize the parameters of a linear code and construct codes with best possible parameters. There are tables of best-known linear codes over finite fields of sizes up to 9. Recently, there has been a growing interest in codes over F13 and other fields of size greater than 9. The main purpose of this work is to present a database of best-known linear codes over the field F13 together with upper bounds on the minimum distances. To find good linear codes to establish lower bounds on minimum distances, an iterative heuristic computer search algorithm is employed to construct quasi-twisted (QT) codes over the field F13 with high minimum distances. A large number of new linear codes have been found, improving previously best-known results. Tables of [pm,m] QT codes over F13 with best-known minimum distances as well as a table of lower and upper bounds on the minimum distances for linear codes of length up to 150 and dimension up to 6 are presented. 2010 MSC: 94B05, 94B65
منابع مشابه
Some new quasi - twisted ternary linear codes ∗
Let [n, k, d]q code be a linear code of length n, dimension k and minimum Hamming distance d over GF (q). One of the basic and most important problems in coding theory is to construct codes with best possible minimum distances. In this paper seven quasi-twisted ternary linear codes are constructed. These codes are new and improve the best known lower bounds on the minimum distance in [6]. 2010 ...
متن کاملGood Quasi-Cyclic Codes from Circulant Matrices Concatenation using a Heuristic Method
In this paper we present a method to search q circulant matrices; the concatenation of these circulant matrices with circulant identity matrix generates quasi-cyclic codes with high various code rate q/(q+1) (q an integer). This method searches circulant matrices in order to find the good quasi-cyclic code (QCC) having the largest minimum distance. A modified simulated annealing algorithm is us...
متن کاملNew linear codes from constacyclic codes
One of the main challenges of coding theory is to construct linear codes with the best possible parameters. Various algebraic and combinatorial methods along with computer searches are used to construct codes with better parameters. Given the computational complexity of determining the minimum distance of a code, exhaustive searches are not feasible for all but small parameter sets. Therefore, ...
متن کاملOne generator $(1+u)$-quasi twisted codes over $F_2+uF_2$
This paper gives the minimum generating sets of three types of one generator (1 + u)-quasi twisted (QT) codes over F 2 + uF 2 , u 2 = 0. Moreover, it discusses the generating sets and the lower bounds on the minimum Lee distance of a special class of A 2 type one generator (1 + u)-QT codes. Some good (optimal or suboptimal) linear codes over F 2 are obtained by these types of one generator (1 +...
متن کاملNew quasi-cyclic codes over F5
one of the most important problems of coding theory is to construct codes with beat possible minimum distances. In this paper, we use the algebraic structure of quasi-cyclic codes and the BCH type bound on the minimum distance to search for quasi-cyclic codes over IFS, the finite field with five elements, which improve the minimum distances of best-known linear codes. We construct 15 new linear...
متن کامل